By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Discrete Mathematics

Table of Contents
Search This Issue
Volume 8, Issue 4, pp. 485-683

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

On-Line and First-fit Coloring of Graphs that Do Not Induce $P_5 $

Henry A. Kierstead, Stephen G. Penrice, and William T. Trotter

pp. 485-498

BibTeX  Abstract Full Text:  PDF

On the $\lambda$-Number of $Q_n $ and Related Graphs

Marshall A. Whittlesey, John P. Georges, and David W. Mauro

pp. 499-506

BibTeX  Abstract Full Text:  PDF

The Median Procedure in a Formal Theory of Consensus

F. R. McMorris and R. C. Powers

pp. 507-516

BibTeX  Abstract Full Text:  PDF

Symmetric Matrices Representable by Weighted Trees over a Cancellative Abelian Monoid

Hans-Jürgen Bandelt and Michael Anthony Steel

pp. 517-525

BibTeX  Abstract Full Text:  PDF

Correlation of Boolean Functions and Pathology in Recursion Trees

Ingo Althöfer and Imre Leader

pp. 526-535

BibTeX  Abstract Full Text:  PDF

Lower Bounds on Formula Size of Boolean Functions Using Hypergraph Entropy

Ilan Newman and Avi Wigderson

pp. 536-542

BibTeX  Abstract Full Text:  PDF

Feasible Offset and Optimal Offset for General Single-Layer Channel Routing

Ronald I. Greenberg and Jau-Der Shih

pp. 543-554

BibTeX  Abstract Full Text:  PDF

Canonical Encoders for Sliding Block Decoders

Jonathan Ashley and Brian Marcus

pp. 555-605

BibTeX  Abstract Full Text:  PDF

Treewidth and Pathwidth of Permutation Graphs

Hans L. Bodlaender, Ton Kloks, and Dieter Kratsch

pp. 606-616

BibTeX  Abstract Full Text:  PDF

Salvage-Embeddings of Complete Trees

Sandeep N. Bhatt, Fan R. K. Chung, Frank Thomson Leighton, and Arnold L. Rosenberg

pp. 617-637

BibTeX  Abstract Full Text:  PDF

Upper and Lower Bounds on Constructing Alphabetic Binary Trees

Maria Klawe and Brendan Mumey

pp. 638-651

BibTeX  Abstract Full Text:  PDF

On Families of Sets of Integral Vectors Whose Representatives form Sum-Distinct Sets

Dusan B. Jevtic

pp. 652-660

BibTeX  Abstract Full Text:  PDF

An Approximation Algorithm for Preemptive Scheduling on Parallel-Task Systems

Ramesh Krishnamurti and Bhagirath Narahari

pp. 661-669

BibTeX  Abstract Full Text:  PDF

Altshuler's Sphere $M_{963}^9 $ Revisited

Jürgen Bokowski and Peter Schuchert

pp. 670-677

BibTeX  Abstract Full Text:  PDF

Equidistribution in all Dimensions of Worst-case Point Sets for the Traveling Salesman Problem

Timothy Law Snyder and J. Michael Steele

pp. 678-683

BibTeX  Abstract Full Text:  PDF